#include <iostream>
using namespace std;
#include <queue>
#include "priority.h"


void test_priority_queue()
{
	//priority_queue<int> q;
	//hsl::priority_queue<int> q;

	hsl::priority_queue<int,vector<int>,greater<int>> q;

	q.push(1);
	q.push(20);
	q.push(3);
	q.push(49);
	q.push(10);
	q.push(30);
	q.push(77);
	q.push(8);
	while (!q.empty())
	{
		cout << q.top()<<' ';
		q.pop();
	}
	cout << endl;
}

int main()
{
	test_priority_queue();
	return 0;
}